Type Infeasible Call Chains
نویسندگان
چکیده
While some software engineering applications perform static analysis over the whole program call graph, others are more interested in specific call chains within a program’s call graph. It is thus important to identify when a particular static call chain for an object-oriented program may not be executable, or feasible, such that there is no input for which the chain will be taken. This paper examines type infeasibility of call chains, which is the infeasibility caused by inherently polymorphic call sites and sometimes also due to imprecision in call graphs. The problem of determining whether a call chain is type infeasible is defined and exemplified, a key property characterizing type infeasible call chains is described, empirical results from examining the call graphs for a set of Java programs are described, and two approaches to automatically deciding the type infeasibility of a call chain due to object parameters are presented.
منابع مشابه
Characterization and automatic identification of type infeasible call chains
Many software engineering applications utilize static program analyses to gain information about programs. Some applications perform static analysis over the whole program's call graph, while others are more interested in speci c call chains within a program's call graph. A particular static call chain for an object-oriented program may in fact be impossible to execute, or infeasible, such that...
متن کاملVMI-type Supply Chains: a Brief Review
The primary purpose of this paper is to highlight for the research community and practitioners the various aspects of using VMI-type supply chains in today’s business environment as well as a number of directions for future studies. In this regard, fifty articles published in major international journals, beginning in 1995, which contribute to the VMI-type supply chains are reviewed via a syste...
متن کاملLooking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorithms yield two primary benefits: 1) they tend to focus on solutions close to the boundary between feasible and infeasible solutions, where active constraints are likely to yield optimal values, and 2) moves that include...
متن کاملNew Primitives to AOP Weaving Capabilities for Security Hardening Concerns
In this paper, we present two new primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. These primitives are called exportParameter and importParameter and are used to pass parameters between two pointcuts. They allow to analyze a program’s call graph in order to determine how to change function signatures for the passing of par...
متن کاملComparing the elastomeric behavior and force degradation pattern between different orthodontic elastomeric chains
Background and Aims: Elastomeric chains are known as a current device with the purpose of dental movement in orthodontic treatments. The aim of this study was to compare the elastomeric behavior and force degradation rate between different elastomeric chains existing in Iran in different time durations. Materials and Methods: 11 different elastomeric chains used in this study were: Class One, ...
متن کامل